Enumeration of certain sequences
نویسندگان
چکیده
منابع مشابه
Enumeration of certain binary vectors
In 1986, W. S. Griffith [2] proposed reliability model and described a Markov chain approach for computing the reliability in the system. F. K. Hwang and S. Papastavridis gave a closed-form formula for this reliability in 1991, by counting the number of n-dimensional binary vectors containing exactly k non-overlapping m-tuples of consecutive ones. In 1988, T. M. Apostol [1] established recursiv...
متن کاملEnumeration of spanning trees of certain graphs
In this note we give an algorithm which enables us to encode and enumerate all the spanning trees of a multipartite graph (see below). This algorithm may turn out to be useful for the enumeration of spanning trees satisfying certain conditions. The number of spanning trees of a given graph Γ without loops and without multiple edges will be denoted by_i(T). We shall consider the graphs Γ = T(G; ...
متن کاملEnumeration of Certain Classes of Antichains
An antichain is here regarded as a hypergraph that satisfies the following property: neither of every two different edges is a subset of the other one. The paper is devoted to the enumeration of antichains given on an n-set and having one or more of the following properties: being labeled or unlabeled; being ordered or unordered; being a cover (or a proper cover); and finally, being a T0-, T1or...
متن کاملOn the enumeration of certain weighted graphs
We enumerate weighted graphs with a certain upper bound condition. We also compute the generating function of the numbers of these graphs, and prove that it is a rational function. In particular, we show that if the given graph is a bipartite graph, then its generating function is of the form p(x) (1−x)m+1 , where m is the number of vertices of the graph and p(x) is a polynomial of degree at mo...
متن کاملOn Certain Monomial Sequences
We give equivalent conditions for a monomial sequence to be a dsequence or a proper sequence, and a sufficient condition for a monomial sequence to be an s-sequence in order to compute invariants of the symmetric algebra of the ideal generated by it.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Arithmetica
سال: 1971
ISSN: 0065-1036,1730-6264
DOI: 10.4064/aa-18-1-221-232